Implementation and Analysis of Helper Threads with SSMT
نویسندگان
چکیده
In this paper, several scenarios for helper threading were implemented and analyzed on the SPEC2000 mcf benchmark [1]. After determining the delinquent load of the mcf benchmark, three helper threading scenarios were implemented to prefetch the delinquent load into L2 cache. First a static loop-based helper process was implemented, followed by a static loop-based helper thread. Finally, a static sample-based helper threading was performed. All helper threads were simulated and evaluated on the SSMT simulator [2]. Our results indicate that sample-based triggering of helper threads results in the greatest improvement on the delinquent load, with a 71% increase in L2 hits and a 66% decrease in L2 misses, when compared to the single-threaded benchmark. However, sample-based triggering is very costly to the main thread as a whole. Consequently, loop-based triggering of the helper thread performs better on the benchmark as a whole, with only a mild speedup of 1.14%.
منابع مشابه
A Survey on Helper Threads and Their Implementations
This survey covers the general idea behind helper threads and the major ways in which they are implemented. The first section covers parallel helper threads and the issues crucial to their role in improving performance. The following sections cover the implementations of parallel helper threads, focusing on SMT processor based implementations and adapted superscalar processor based implementati...
متن کاملParallel Implementation of Particle Swarm Optimization Variants Using Graphics Processing Unit Platform
There are different variants of Particle Swarm Optimization (PSO) algorithm such as Adaptive Particle Swarm Optimization (APSO) and Particle Swarm Optimization with an Aging Leader and Challengers (ALC-PSO). These algorithms improve the performance of PSO in terms of finding the best solution and accelerating the convergence speed. However, these algorithms are computationally intensive. The go...
متن کاملCompiler-Based Pre-Execution
Title of dissertation: COMPILER-BASED PRE-EXECUTION Dongkeun Kim, Doctor of Philosophy, 2004 Dissertation directed by: Professor Donald Yeung Department of Electrical and Computer Engineering Pre-execution is a novel latency-tolerance technique where one or more helper threads run in front of the main computation and trigger long-latency delinquent events early so that the main thread makes for...
متن کاملVerification of Stochastic Systems by Stochastic Satisfiability Modulo Theories with Continuous Domain (CSSMT)
Stochastic Satisfiability Modulo Theories (SSMT) is a quantitative extension of Satisfiability Modulo Theories (SMT) inspired by stochastic logics. It extends SMT by randomized quantifiers, facilitating capture of stochastic game properties in the logic, like reachability analysis of hybrid-state Markov decision processes. Solving SSMT formulae with quantification over finite and thus discrete ...
متن کاملModeling and Optimization of Speculative Threads
Modeling and Optimization of Speculative Threads Tor M. Aamodt Doctor of Philosophy Department of Electrical and Computer Engineering University of Toronto 2006 This dissertation proposes a framework for modeling the control flow behavior of a program and the application of this framework to the optimization of speculative threads used for instruction and data prefetch. A novel form of helper t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004